Ergodic Classical-Quantum Channels: Structure and Coding Theorems

We consider ergodic causal classical-quantum channels (cq-channels) which additionally have a decaying input memory. In the first part we develop some structural properties of ergodic cq-channels and provide equivalent conditions for ergodicity. In the second part we prove the coding theorem with weak converse for causal ergodic cq-channels with decaying input memory. Our proof is based on the possibility to introduce joint input-output state for the cq-channels and an application of the Shannon-McMillan theorem for ergodic quantum states. In the last part of the paper it is shown how this result implies coding theorem for the classical capacity of a class of causal ergodic quantum channels.Comment: 19 pages, no figures. Final versio

A new graph perspective on max-min fairness in Gaussian parallel channels

In this work we are concerned with the problem of achieving max-min fairness in Gaussian parallel channels with respect to a general performance function, including channel capacity or decoding reliability as special cases. As our central results, we characterize the laws which determine the value of the achievable max-min fair performance as a function of channel sharing policy and power allocation (to channels and users). In particular, we show that the max-min fair performance behaves as a specialized version of the Lovasz function, or Delsarte bound, of a certain graph induced by channel sharing combinatorics. We also prove that, in addition to such graph, merely a certain 2-norm distance dependent on the allowable power allocations and used performance functions, is sufficient for the characterization of max-min fair performance up to some candidate interval. Our results show also a specific role played by odd cycles in the graph induced by the channel sharing policy and we present an interesting relation between max-min fairness in parallel channels and optimal throughput in an associated interference channel.Comment: 41 pages, 8 figures. submitted to IEEE Transactions on Information Theory on August the 6th, 200